Towards Term Rewriting Systems in Constraint Handling Rules Coming to terms with jungles
نویسندگان
چکیده
Term rewriting systems are a formalism in widespread use, often implemented by means of term graph rewriting. In this work we present preliminary results towards an elegant embedding of term graph rewriting in Constraint Handling Rules with rule priorities (CHR). As term graph rewriting is well-known to be incomplete with respect to term rewriting, we aim for sound jungle evaluation in CHR. Having such an embedding available allows to benefit from CHR’s online property and parallelization potential.
منابع مشابه
Implementing term rewriting by jungle evaluation
Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle evaluation rules which implement parallel term rewriting steps. By using additional hypergraph rules which “fold” equal subterms, even non-left-linear term rewriting systems can be implemented. As a side effect, these folding rules can speed up the...
متن کاملACD Term Rewriting
In this paper we introduce Associative Commutative Distributive Term Rewriting (ACDTR), a rewriting language for rewriting logical formulae. ACDTR extends AC term rewriting by adding distribution of conjunction over other operators. Conjunction is vital for expressive term rewriting systems since it allows us to require that multiple conditions hold for a term rewriting rule to be used. ACDTR u...
متن کاملAbstract Critical Pairs and Confluence of Arbitrary Binary Relations
Critical Pairs and Confluence of Arbitrary Binary Relations Rémy Haemmerlé and François Fages Projet Contraintes – INRIA Rocquencourt – France [email protected] Abstract. In a seminal paper, Huet introduced abstract properties of term rewriting systems, and the confluence analysis of terminating term rewriting systems by critical pairs computation. In this paper, we provide an abstrac...
متن کاملOn Completion of Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. An important property of any constraint solver is connuence: The result of a computation should be independent from the order in which constraints arrive and in which rules are applied. In previous work 1], a suucient and necessary condition for the connu...
متن کاملProving termination of CHR in Prolog: A transformational approach
In this paper we present a termination preserving transformation from Constraint Handling Rules to Prolog. The transformation is sound w.r.t. termination under the theoretical semantics of Constraint Handling Rules. It does not consider the presence of a propagation history. The transformation allows for the direct reuse of termination proof methods from Logic Programs and Term-Rewrite Systems,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008